es:ES, Cmd:Type, In:AbsInterface(Cmd), isupdate:(Cmd), Sys, Out:AbsInterface(Top).
(E(In) r E(Sys))
 (f:sys-antecedent(es;Sys), chain:(E(Sys)(Id List)).
 chain-consistent(f;chain)
  (e, e':E(Sys). loc(e) << loc(e')  (loc(e) = loc(e')  Id)  loc(e') << loc(e))) 

latex

Up	abstract chain replication
Definitions	t  T, chain-config(es;Sys;chain), x:AB(x), x:A. B(x), s = t, strong-subtype(A;B), P  Q, ES, Type, AbsInterface(A), sys-antecedent(es;Sys), chain-consistent(f;chain), E(X), x:A  B(x), b, left + right, , {x:A| B(x)} , type List, x:A. B(x), P  Q, a < b, A, P & Q, hd(l), L1  L2, e loc e' , adjacent(T;L;x;y), (x  l), no_repeats(T;l), Top, Id, f(a), loc(e), ||as||, #$n, (e <loc e'), EState(T), a:A fp B(a), , EqDecider(T), Unit, IdLnk, EOrderAxioms(E; pred?; info), kindcase(k; a.f(a); l,t.g(l;t) ), Knd, loc(e), kind(e), Msg(M), , val-axiom(E;V;M;info;pred?;init;Trans;Choose;Send;val;time), r  s, e < e', constant_function(f;A;B), SWellFounded(R(x;y)), , pred!(e;e'), x,y. t(x;y), <a, b>, pred(e), first(e), x. t(x), E, e c e', x << y, Dec(P), False, P  Q, A  B, b | a, a ~ b, a  b, a <p b, a < b, A c B, x f y, xL. P(x), (xL.P(x)), y is f*(x), r < s, q-rel(r;x), Outcome, l_disjoint(T;l1;l2), (e < e'), e<e'.P(e), ee'.P(e), e<e'. P(e), ee'.P(e), e[e1,e2).P(e), e[e1,e2).P(e), e[e1,e2].P(e), e[e1,e2].P(e), e(e1,e2].P(e), MaName, last(L), e  X, X(e), if b then t else f fi , increasing(f;k), {i..j}
Lemmas	event system wf, sys-antecedent wf, chain-consistent wf, chain-order wf, decidable or, decidable equal Id, es-causle wf, es-E wf, es-interface wf, deq wf, EOrderAxioms wf, IdLnk wf, Msg wf, unit wf, nat wf, val-axiom wf, qle wf, cless wf, bool wf, top wf, Knd wf, kindcase wf, constant function wf, assert wf, not wf, loc wf, pred! wf, strongwellfounded wf, member wf, rationals wf, EState wf, subtype rel wf, chain-order-total-config, l member wf, no repeats wf, es-locl wf, Id wf, sublist wf, es-E-interface wf, chain-config wf